FIHT2 Algorithm: A Fast Incremental Hough Transform

FIHT2 algorithm defined by p = x . cos 0 + y .sin 0 + (a/(21()) . x . s ine at 0 5 6 < a / 2 and at p = x . cose + y . sin 0 + (aJ(2It')) . y . cos 0 at a / 2 5 0 < a is a Hough transform which requires nothing of the trigonometric and functional operations to generate the Hough distributions. It is demonstrated in this paper that the FIHT2 is a complete alternative of the usual Hough transform(HT) defined by p = x.cos O+y.sin 0 in the sense that the both transforms could work perfectly as a line detector. It is easy to show that the Hough curves of the FIIJT2 can be generated in a incremental way where addition operation is exclusively needed. It is also investigated that the difference between HT and FIHT2 could be estimated to be neglected.